Approximate one-to-one point pattern matching
نویسندگان
چکیده
منابع مشابه
Approximate one-to-one point pattern matching
Given a set A ={a1, . . . ,an} of n image points and a set B ={b1, . . . ,bn} of n model points,the problem is to find a transformation matching (a one-to-one mapping) each point a ∈ A tosome point b ∈ B such that the length of the longest edge in the matching is minimized (so-calledbottleneck distance). The geometric transformations we allow are translation, rot...
متن کاملOne-Dimensional Vector based Pattern Matching
Template matching is a basic method in image analysis to extract useful information from images. In this paper, we suggest a new method for pattern matching. Our method transform the template image from two dimensional image into one dimensional vector. Also all sub-windows (same size of template) in the reference image will transform into one dimensional vectors. The three similarity measures ...
متن کاملDominance invariant one-to-one matching problems
Solution concepts in social environments use either a direct or indirect dominance relationship, depending on whether it is assumed that agents are myopic or farsighted. Direct dominance implies indirect dominance, but not the reverse. Hence, the predicted outcomes when assuming myopic (direct) or farsighted (indirect) agents could be very different. In this paper, we characterize dominance inv...
متن کاملEfficient Many-To-Many Point Matching in One Dimension
[email protected] 2 Department of Computer Science, Villanova University, Villanova, USA. e-mail: [email protected] 3 Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Barcelona, Spain. Partially supported by projects MCYT BFM2003-00368, MEC MTM2006-01267 and Gen. Cat. 2005SGR00692. e-mail: [email protected] 4 Chercheur qualifié du FNRS, Département d...
متن کاملApproximate input sensitive algorithms for point pattern matching
Article history: Received 31 January 2009 Received in revised form 1 May 2009 Accepted 17 May 2009
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2012
ISSN: 1570-8667
DOI: 10.1016/j.jda.2012.03.002